Automated Debugging of Logic Programs via Theory Revision
نویسندگان
چکیده
This paper presents results on using a theory revision system to automatically debug logic programs. Forte is a recently developed system for revising function-free Horn-clause theories. Given a theory and a set of training examples, it performs a hillclimbing search in an attempt to minimally modify the theory to correctly classify all of the examples. Forte makes use of methods from propositional theory revision, Hornclause induction (Foil), and inverse resolution. The system has has been successfully used to debug logic programs written by undergraduate students for a programming languages course.
منابع مشابه
Diagnosis and Debugging as Contradiction Removal in Logic Programs
We apply to normal logic programs with integrity rules a contradiction removal approach, and use it to uniformly treat diagnosis and debugging, and as a matter of fact envisage programs as artifacts and fault-nding as debugging. Our originality resides in applying to such programs the principle that if an assumption leads to contradiction then it should be revised: assumptions are not A literal...
متن کاملBelief Revision in Non-Monotonic Reasoning and Logic Programming
In order to be able to explicitly reason about beliefs, we've introduced a non-monotonic formalism, called the Autoepistemic Logic of Beliefs, AEB, obtained by augmenting classical propositional logic with a belief operator, B. For this language we've deened the static autoepistemic expansions semantics. The resulting non-monotonic knowledge representation framework turned out to be rather simp...
متن کاملTowards Agent-Oriented Knowledge Base Maintenance for Description Logic ALCN
Artificial agents functioning in the Semantic Web are to be capable of getting knowledge from diverse sources. This implies the capability to continuously update their knowledge bases. New stream reasoning concepts make this need even more pressing. Semantic Web ontologies are commonly represented using description logic knowledge bases. We propose an agent architecture with such features, util...
متن کاملar X iv : c s . SE / 0 01 20 07 v 3 5 J an 2 00 1 Kima – an Automated Error Correction System for Concurrent Logic Programs
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explicit declarations of program properties. Strong moding/typing and constraint-based analysis are turning to play fundamental roles in debugging concurrent logic programs as well as in establishing the consistency of commu...
متن کاملOn-the-Fly Model Checking of Program Runs for Automated Debugging
In this paper, an on-the-fly algorithm is developed for model checking of temporal logic safety properties on partially ordered occurrence net structures. This algorithm is used for the automated debugging of parallel programs. During the monitoring of a program run, a state action net is constructed from the program trace. Temporal specifications are evaluated on-the-fly with respect to this n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992